Alpha-Concave Hull, a Generalization of Convex Hull
نویسندگان
چکیده
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare this concept with convex hull and alpha shape. We show that the alpha-concave hull is also a generalization of an NP-complete problem named minarea TSP. We prove that computing the alpha-concave hull is NP-hard on a set of points.
منابع مشابه
Minimum area enclosure and alpha hull of a set of freeform planar closed curves
Of late, researchers appear to be intrigued with the question; Given a set of points, what is the region occupied by them? The answer appears to be neither straight forward nor unique. Convex hull, which gives a convex enclosure of the given set, concave hull, which generates nonconvex polygons and other variants such as α-hull, poly hull, r-shape and s-shape etc. have been proposed. In this pa...
متن کاملA New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets
Convex and concave hulls are useful concepts for a wide variety of application areas, such as pattern recognition, image processing, statistics, and classification tasks. Concave hull performs better than convex hull, but it is difficult to formulate and few algorithms are suggested. Especially, an n-dimensional concave hull is more difficult than a 2or 3dimensional one. In this paper, we propo...
متن کاملLarge data sets classification using convex-concave hull and support vector machine
Normal support vector machine (SVM) is not suitable for classification of large data sets because of high training complexity. Convex hull can simplify the SVM training. However, the classification accuracy becomes lower when there exist inseparable points. This paper introduces a novel method for SVM classification, called convex–concave hull SVM (CCH-SVM). After grid processing, the convex hu...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملEnhanced Way for Computing Smallest Convex Polygon and Euler Number
A convex hull is a polygon which encloses all given set of points.Euler number or Euler characteristic of an image has proven to be an important feature in many image analyses and visual inspection applications. This paper presents an algorithm for fast computing the convex hull of a planar scattered point set, which pre-strike an initial convex hull boundary, remove internal points in the boun...
متن کامل